A Demand Driven Computation Strategy for Lazy Narrowing
نویسندگان
چکیده
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. This paper speciies a computation strategy for lazy conditional narrowing, based on the idea of transforming patterns into decision trees to control the computation. The speciication is presented as a translation of CTRS into Prolog, which makes it executable and portable. Moreover, in comparison to related approaches, our method works for a wider class of CTRS.
منابع مشابه
Efficient Compilation of Lazy Narrowing into Prolog
The paper presents new techniques for the transformation of lazy narrowing in logic programs. A formalism, called demand patterns, is introduced , and used to deene a demand driven strategy to compute lazy narrowing. The strategy is used to produce standard PROLOG code from programs written in a functional-logic language. Our method has a number of advantages over other approaches. While it can...
متن کاملA Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
We generalize the Constructor-based ReWriting Logic CRWL to the setting of the simply typed λ-calculus, where theories are presented by conditional overlapping fully extended pattern rewrite systems. We claim that this logic is useful for higher-order functional-logic programming, and propose a Higher-Order Lazy Narrowing calculus HOLNDT for answering joinability and reducibility queries, in wh...
متن کاملA Debugging Model for Lazy Narrowing
One of the main diiculties within all implementations of lazy narrowing consists of nding good control regimes which avoid repeated evaluations of arguments and minimize the risk of non termination. The demand driven control regime presented in 2] arose as an attempt of solving the mentioned problems. Nevertheless, such control regime makes quite hard to foresee the sequence of evaluations due ...
متن کاملA Debugging Model for Lazy Functional Logic Languages
In this paper we present a debugging model for a lazy functional logic programming language whose semantics is based on lazy narrowing under a particular strategy 1 : Demand Driven Strategy (dds). The sophisticated operational semantics under dds-in computing head normal forms for total functions applications-makes necessary to develop a good debugging model which reeects the computational beha...
متن کاملDeclarative Constraint Programming with Definitional Trees
The new generic scheme CFLP (D) has been recently proposed in [14] as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain D. Further, [15] presented a Constrained Lazy Narrowing Calculus CLNC(D) as a convenient computation mechanism for solving goals for CFLP (D)-programs, which was proved sound and strongly complete wi...
متن کامل